On the bipartite independence number of a balanced bipartite graph
نویسندگان
چکیده
منابع مشابه
A balanced independence number condition for a balanced bipartite graph to be Hamiltonian
Let G be a 2-connected balanced bipartite graph with partite sets X1 and X2. We denote α∗ BIP (G) be the maximum cardinality of an independent set A1∪A2 of G such that A1 ⊂ X1, A2 ⊂ X2 and ∣∣|A1| − |A2|∣∣ ≤ 1. In this paper, we prove that if α∗ BIP (G) ≤ 2δ(G)− 2, then G is Hamiltonian. This condition is best possible, and this implies several known results, for example, in [1, 6, 7, 11]. Also ...
متن کاملHamiltonian properties and the bipartite independence number
By using the notion of compatibility of subgraphs with a perfect matching developed for digraphs in [1], we show that if, in a balanced bipartite graph G of minimum degree 6, the maximum cardinality ebip of a balanced independent subset satisfies ~bip ~< 26-4, then G is hamiltonian-biconnected, and if Ctbip ~< 26-2, G contains a hamiltonian path. Moreover, we give some properties of balanced bi...
متن کاملA note on the independence number in bipartite graphs
The independence number of a graph G, denoted by α(G), is the maximum cardinality of an independent set of vertices in G. The transversal number of G is the minimum cardinality of a set of vertices that covers all the edges of G. If G is a bipartite graph of order n, then it is easy to see that n 2 ≤ α(G) ≤ n − 1. If G has no edges, then α(G) = n = n(G). Volkmann [Australas. J. Combin. 41 (2008...
متن کاملOn the number of maximal bipartite subgraphs of a graph
We show new lower and upper bounds on the number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105n/10 ≈ 1.5926n such subgraphs, which improves an earlier lower bound by Schiermeyer (1996). We show an upper bound of n·12n/4 ≈ n·1.8613n and give an algorithm that lists all maximal induced bipartite subgraphs in time proportional ...
متن کاملBalanced coloring of bipartite graphs
Given a bipartite graph G(U ∪ V, E) with n vertices on each side, an independent set I ∈ G such that |U ⋂ I| = |V ⋂ I| is called a balanced bipartite independent set. A balanced coloring of G is a coloring of the vertices of G such that each color class induces a balanced bipartite independent set in G. If graph G has a balanced coloring we call it colorable. The coloring number χB(G) is the mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90537-4